Decidable Navigation Logics for Object Structures
نویسندگان
چکیده
In this paper, we introduce decidable multimodal logics to describe and reason about navigation across object structures. The starting point of these navigation logics is the modelling of object structures as Kripke models that contain a family of deterministic accessibility relations; one for each pointer attribute. These pointer attributes are used in the logics both as first-order terms in equalities and as modal operators. To handle the ambiguities of pointer attributes the logics also cover a mechanism to bind logical variables to objects that are reachable by a pointer. The main result of this paper is a tableau construction for deciding the validity of formulas in the navigation logics.
منابع مشابه
Non-primitive recursive decidability of products of modal logics with expanding domains
We show that—unlike products of ‘transitive’ modal logics which are usually undecidable— their ‘expanding domain’ relativisations can be decidable, though not in primitive recursive time. In particular, we prove the decidability and the finite expanding product model property of bimodal logics interpreted in two-dimensional structures where one component—call it the ‘flow of time’—is • a finite...
متن کاملTemporal Logics on Words with Multiple Data Values
The paper proposes and studies temporal logics for attributed words, that is, data words with a (finite) set of (attribute,value)-pairs at each position. It considers a basic logic which is a semantical fragment of the logic LTL1 of Demri and Lazic with operators for navigation into the future and the past. By reduction to the emptiness problem for data automata it is shown that this basic logi...
متن کاملVerification via Structure Simulation
This paper shows how to harness decision procedures to automatically verify safety properties of imperative programs that perform dynamic storage allocation and destructive updating of structure fields. Decidable logics that can express reachability properties are used to state properties of linked data structures, while guaranteeing that the verification method always terminates. The main tech...
متن کاملA decidable theory of nitely-layered metric temporal structures
We study the decidability problem for metric and layered temporal logics. The logics we consider are suitable to model time granularity in various contexts, and they allow one to build granular temporal models by referring to thènatural scale' in any component of the model and by properly constraining the interactions between diierently-grained components. A monadic second-order language combin...
متن کاملAll Nitely Axiomatizable Subframe Logics Containing the Provability Logic Csm 0 Are Decidable
In this paper we investigate those extensions of the bimodal provability logicCSM0 (alias PRL1 or F ) which are subframe logics, i.e. whose general frames are closed under a certain type of substructures. Most bimodal provability logics are in this class. The main result states that all nitely axiomatizable subframe logics containing CSM0 are decidable. We note that, as a rule, interesting syst...
متن کامل